A normal form for arithmetical representation of N P-sets

A Normal form for P-Systems

The P-systems have been recently introduced in [4] as a new model for distributed parallel computing. We describe in this paper a normal form for the class of non-cooperative P-systems and prove a normalization theorem. By this result, we also prove that the hierarchy of non-cooperative P-systems with respect to depth collapses on the second level.

Strongly Rational Sets for Normal-Form Games

Curb sets [Basu and Weibull, Econ. Letters 36 (1991), 141-146] are product sets of pure strategies containing all individual best-responses against beliefs restricted to the recommendations to the remaining players. The concept of minimal curb sets is a set-theoretic coarsening of the notion of strict Nash equilibrium. We introduce the concept of minimal strong curb sets which is a set-theoreti...

Fuzzy sets form A meta-system-theoretic point of view

Arithmetical Metabolic P Systems

Metabolic P systems, a class of P systems introduced for modeling metabolic processes, proved to be promising in many contexts from bio-modelling to function approximation. In this paper we define a deterministic computational model based on this systems. This on-line version introduces the preliminary metabolic framework Lamp in section 4.

Mixed Strong Form Representation Particle Method for Solids and Structures

In this paper, a generalized particle system (GPS) method, a general method to describe multiple strong form representation based particle methods is described. Gradient, divergence, and Laplacian operators used in various strong form based particle method such as moving particle semi-implicit (MPS) method, smooth particle hydrodynamics (SPH), and peridynamics, can be described by the GPS metho...